The complexity of broadcasting in bounded-degree networks
نویسنده
چکیده
Because of cost and physical limitations there is an interest in broadcast networks with a fixed maximum number of communication links for each node, [BHLP,LP,DFF]. In this note we show that given an arbitrary bounded-degree network, determining the minimum broadcast time for any originating node is NPcomplete. For the NP-completeness proof of the general case of unbounded-degree networks, it is straightforward to reduce the instances of the three dimensional matching problem (3DM) to a corresponding minimum broadcast time problem (MBT), [GJ].
منابع مشابه
Efficient broadcasting with linearly bounded faults I*,
We consider the problem of broadcasting in the presence of linearly bounded number of transient faults. For some fixed 0 <IX < 1 we assume that at most zi faulty transmissions can occur during the first i time units of the broadcasting algorithm execution, for every natural i. In a unit of time every node can communicate with at most one neighbor. We prove that some bounded degree networks are ...
متن کاملComplexity and approximation ratio of semitotal domination in graphs
A set $S subseteq V(G)$ is a semitotal dominating set of a graph $G$ if it is a dominating set of $G$ andevery vertex in $S$ is within distance 2 of another vertex of $S$. Thesemitotal domination number $gamma_{t2}(G)$ is the minimumcardinality of a semitotal dominating set of $G$.We show that the semitotal domination problem isAPX-complete for bounded-degree graphs, and the semitotal dominatio...
متن کاملBroadcasting in Bounded Degree Graphs
Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the network. Several previous papers have investigated methods to construct sparse graphs (networks) in which this process can be completed in minimum time from any originator. The graphs produced by these met...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملThe Complexity of Broadcasting in Planar and Decomposable Graphs
z Abstract Broadcasting in processor networks means disseminating a single piece of information, which is originally known only at some nodes, to all members of the network. The goal is to inform everybody using as few rounds as possible, that is minimize the broadcasting time. Given a graph and a subset of nodes, the sources, the problem to determine its speciic broadcast time, or more general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/math/9411222 شماره
صفحات -
تاریخ انتشار 1994